Defaults and Infinitesimals Defeasible Inference by Nonarchimedean Entropy-Maximization
نویسنده
چکیده
We develop a new semantics for defeasible infer ence based on extended probability measures al lowed to take infinitesimal values, on the inter pretation of defaults as generalized conditional probability constraints and on a preferred-model implementation of entropy-maximization.
منابع مشابه
System JLZ - rational default reasoning by minimal ranking constructions
We present a powerful quasi-probabilistic default formalism for graded defaults based on a well-motivated canonical ranking construction procedure, System JLZ. It implements the minimal construction paradigm and verifies the major inference principles and inheritance desiderata, including rational monotony for propositions and structured cumulativity for default conditionals. With help from a s...
متن کاملConstraints , Causal Rules and Minimal
We consider knowledge base update while the domain constraints are explicitly taken into account. We argue that the traditional constraint form is problematic to capture the causality of the domain, and ignoring this point may lead to diiculties in knowledge base updates. To handle this problem properly, it is necessary to describe the causal rules of the domain explicitly in the update formali...
متن کاملPragmatics and Word Meaning
In this paper, we explore the interaction between lexical semantics and pragmatics. We argue that linguistic processing is informationally encapsulated and utilises relatively simple ‘taxonomic’ lexical semantic knowledge. On this basis, defeasible lexical generalisations deliver defeasible parts of logical form. In contrast, pragmatic inference is openended and involves arbitrary real-world kn...
متن کاملModel-Preference Default Theories
Most formal theories of default inference have very poor computational properties, and are easily shown to be intractable, or worse, undecidable. We are therefore investigating limited but efficiently computable theories of default reasoning. This paper defines systems of Propositional Model-Preference Defaults, which provide a true modeltheoretic account of default inference with exceptions. T...
متن کاملTransaction Logic with Defaults and Argumentation Theories
Transaction Logic (abbr., T R) [9,12] is a logic that gracefully integrates both declarative and procedural knowledge. It has proved itself as a powerful logic language for many advanced applications, including actions specification and planning in AI. In a parallel development, much work has been devoted to various theories of defeasible reasoning [19]. In this paper, we unify these two stream...
متن کامل